Template-based searches for gravitational waves: efficient lattice covering of flat parameter spaces

The construction of optimal template banks for matched-filtering searches is an example of the sphere covering problem. For parameter spaces with constant-coefficient metrics a (near-) optimal template bank is achieved by the A_n* lattice, which is the best lattice-covering in dimensions n <= 5, and is close to the best covering known for dimensions n <= 16. Generally this provides a substantially more efficient covering than the simpler hyper-cubic lattice. We present an algorithm for generating lattice template banks for constant-coefficient metrics and we illustrate its implementation by generating A_n* template banks in n=2,3,4 dimensions.Comment: 10 pages, submitted to CQG for proceedings of GWDAW1

The isodiametric problem with lattice-point constraints

In this paper, the isodiametric problem for centrally symmetric convex bodies in the Euclidean d-space R^d containing no interior non-zero point of a lattice L is studied. It is shown that the intersection of a suitable ball with the Dirichlet-Voronoi cell of 2L is extremal, i.e., it has minimum diameter among all bodies with the same volume. It is conjectured that these sets are the only extremal bodies, which is proved for all three dimensional and several prominent lattices.Comment: 12 pages, 4 figures, (v2) referee comments and suggestions incorporated, accepted in Monatshefte fuer Mathemati

The contact polytope of the leech lattice

The contact polytope of a lattice is the convex hull of its shortest vectors. In this paper we classify the facets of the contact polytope of the Leech lattice up to symmetry. There are 1, 197, 362, 269, 604, 214, 277, 200 many facets in 232 orbits.Delft Institute of Applied MathematicsElectrical Engineering, Mathematics and Computer Scienc